搜索资源列表
filter1
- 高通滤波器，带通滤波器，数字FIR滤波器-The Shannon entropy is a measure of the average information content one is missing when one does not know the value of the random variable. The concept was introduced by Claude E. Shannon in his 1948 paper "A Mathematical Theory
LosslessShiftCodingAlgorithm
- Author: This Code written By Dr. Faisel G. Mohammed (Lecturer in Science college- Computer Dep.-Iraq: Email: fgmnjt@scbaghdad.edu.iq ) Purposes: for Bsc Students in Multimedia Lab. To Learn Lossless Shift Coding Algorithm in digital image com
CALIC
- Context-Based, Adaptive, Lossless Image Coding（CALIC）很经典的进无损压缩标准原文-Context-Based, Adaptive, Lossless Image Coding（CALIC）
HuffmanCode
- Huffman 编码是第一个实用的无损压缩编码技术，经过了多年的不断改进，已经形成了系统的理论和方法。目前主要有两种类型的Huffman编码方式，即静态Huffman编码和动态Huffman编码。Huffman编码有着广泛的应用，但是不再是压缩算法的全部，而是被当作最终的编码方法。-Huffman coding is the first practical lossless compression coding technology, after years of continuous impr
xiangnong
- 正确实现的算术编码算法压缩能力Shannond定理描述的理论极限，是目前已知的压缩能力最强的无损压缩算法。-Correct implementation of arithmetic coding compression algorithm described Shannond theoretical limit theorems, is the strongest known lossless compression algorithms.
bcl-1.2.0
- RLE又叫Run Length Encoding，是一个针对无损压缩的非常简单的算法。它用重复字节和重复的次数来简单描述来代替重复的字节。尽管简单并且对于通常的压缩非常低效，但它有的时候却非常有用（例如，JPEG就使用它）。 RLE可以使用很多不同的方法。基本压缩库中详细实现的方式是非常有效的一个。一个特殊的标记字节用来指示重复节的开始，而不是对于重复非重复节都coding run。因此非重复节可以有任意长度而不被控制字节打断，除非指定的标记字节出现在非重复节（顶多以两个字节来编码）的稀有情况下
huffmam_coding
- In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression
ee
- Huffman Coding是一种无损压缩编码方式，以哈夫曼树—即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman Coding is a lossless compression method to Huffman tree- that is the optimal tree, weighted path length of the smallest binary tree, often used in data compression.
Dictionarycode
- 词典编码编码程序源代码，无损压缩编码的一种-Dictionary coding source code encoding, a lossless compression
Gouzao_Bianma
- 本程序用matlab编写。实现图像的构造编码。压缩包中的PPT介绍构造编码。一个编码程序，一个解码程序。本程序是无损压缩，编码后可压缩掉30 以上。附有图片。程序有必要的注释。-This program written by matlab. The structure of image coding. PPT introduced compressed package structure encoding. A coding process, a decoding program. This p
entropy-encoding
- 视频信号熵编码源程序 熵编码法是一种进行无损数据压缩的技术，在这个技术中一段文字中的每个字母被一段不同长度的比特(Bit)所代替。与此相对的是LZ77或者LZ78等数据压缩方法，在这些方法中原文的一段字母列被其它字母取代。 每个字母按照其出现的可能性所获得的最佳比特数取决于熵。 本程序不仅提供源程序，还提供相应的实例。-Entropy coding the video signal source for entropy coding method is a lossless data
arithmetic
- 算术编码是信源编码中的一种，是图像压缩的主要算法之一。 是一种无损数据压缩方法，也是一种熵编码的方法。-Arithmetic coding is a source coding, image compression is one of the main algorithms. Is a lossless data compression method, but also a method of entropy coding.
1HUFFMANN
- Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been
DCT
- JPEG标准中规定了4种压缩模式[15]：顺序编码（Sequential encoding），渐进编码（Progressive encoding），等级编码（Hierarchical encoding），无损编码（Lossless encoding）。应用最为广泛的为基于DCT变换的顺序编码，也称之为基准模式(Baseline mode)，其它几种模式都以此为基础。这里，采用了JPEG基准模式对图像进行压缩，在基准模式中，熵编码采用哈夫曼编码方法。 -JPEG standard specif
COLOR-IMAGE-COMPRESSION
- The efficiency of perceptual coding in compressing color images relies on the estimation of perceptual redundancy. In this paper, a color image coder is proposed for perceptually lossless image compression which shapes the coding error as a p
suanshubianma
- 算术编码算法，是图像压缩的主要算法之一。 是一种无损数据压缩方法，也是一种熵编码的方法。-Arithmetic coding algorithm, image compression is one of the main algorithm. Is a lossless data compression method, but also a method of entropy coding.
huffmn
- In computer science and information theory, Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) wh
huffman
- huffman 压缩 解压。基于Huffman 编码的无损压缩（lossless data compression）和解压缩算法。 假设压缩和解压缩程序分别为huffmanEnc, huffmanDec。-huffman compression decompression. Lossless compression based on Huffman coding (lossless data compression) and decompression algorithms. Assuming
prg1
- Huffman编码：实现无损压缩的一种编码方法-Huffman coding: realize the lossless compression encoding method
HuffCode
- Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been